Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem
نویسندگان
چکیده
منابع مشابه
Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem
As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objecti...
متن کاملAn Ant Colony System Metaheuristic Algorithm for Solving a Bi-Objective Purchasing Scheduling Problem
In this work the Purchasing Scheduling Problem (PSP) is presented, based in study cases of public and private sectors. PSP models the purchasing process in both scenarios through an optimization approach. It is based on the multi-objective formulation of the knapsack problem. Therefore, PSP is defined as a based-graph problem with two objectives: maximization of satisfied demands and minimizati...
متن کاملA HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL
This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...
متن کاملA Novel Adapted Multi-objective Meta-heuristic Algorithm for a Flexible Bi-objective Scheduling Problem Based on Physics Theory
We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evalua...
متن کاملA Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
We consider the bi-objective prize-collecting Steiner tree problem, whose goal is to find a subtree considering the conflicting objectives of minimizing the edge costs for building that tree, and maximizing the collected node revenues. From a practical perspective, the problem is important whenever node revenues and edge costs cannot be easily expressed using the same (e.g., monetary) units. Fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2015
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0132600